Freeze TCP with timestamps for fast packet loss recovery after disconnections
نویسندگان
چکیده
TCP optimization for wireless networks, for dealing with packet losses and disconnections due to fading, shadowing and handoffs, ideally should maintain TCP end-to-end semantics with minimal dependence on intermediate nodes. This paper presents such a mechanism that uses disconnection duration estimates at the receiver, derived from timestamps, to avoid an increase in the retransmission timeout (RTO) estimate at the sender following disconnections. Simulation results are presented to illustrate the problem, and to show that the proposed modification significantly improves performance. Incorporating this into the recently proposed Freeze -TCP scheme, which uses disconnection predictions at the receiver, is shown to increase robustness to packet losses during disconnections.
منابع مشابه
RR-TCP: A Reordering-Robust TCP with DSACK
TCP performs poorly on paths that reorder packets significantly, where it misinterprets out-of-order delivery as packet loss. The sender responds with a fast retransmit though no actual loss has occurred. These repeated false fast retransmits keep the sender’s window small, and severely degrade the throughput it attains. Persistent reordering occasionally occurs on present-day networks. Moreove...
متن کاملMomentary Recovery Algorithm: A New Look at the Traditional Problem of TCP
Traditional TCP has a good congestion control strategy that adapts its sending rate in accordance with network congestion. In addition, a fast recovery algorithm can help TCP achieve better throughput by responding to temporary network congestion well. However, if multiple packet losses occur, the time to enter congestion avoidance phase would be delayed due to the long recovery time. Moreover,...
متن کاملRFC 3522 The Eifel Detection Algorithm for TCP
The Eifel detection algorithm allows a TCP sender to detect a posteriori whether it has entered loss recovery unnecessarily. It requires that the TCP Timestamps option defined in RFC 1323 be enabled for a connection. The Eifel detection algorithm makes use of the fact that the TCP Timestamps option eliminates the retransmission ambiguity in TCP. Based on the timestamp of the first acceptable AC...
متن کاملRFC 3522 The Eifel Detection Algorithm
The Eifel detection algorithm allows a TCP sender to detect a posteriori whether it has entered loss recovery unnecessarily. It requires that the TCP Timestamps option defined in RFC 1323 be enabled for a connection. The Eifel detection algorithm makes use of the fact that the TCP Timestamps option eliminates the retransmission ambiguity in TCP. Based on the timestamp of the first acceptable AC...
متن کاملImproving TCP’s Performance under Reordering with DSACK
TCP performs poorly on paths that reorder packets significantly, where it misinterprets out-of-order delivery as packet loss. The sender responds with a fast retransmit though no actual loss has occurred. These repeated false fast retransmits keep the sender’s window small, and severely degrade the throughput it attains. Persistent reordering occasionally occurs on present-day networks. Moreove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Communications
دوره 26 شماره
صفحات -
تاریخ انتشار 2003